Basis functions for concave polygons
نویسندگان
چکیده
Polynomials suffice as finite element basis functions for triangles, parallelograms, and some other elements of little practical importance. Rational basis functions extend the range of allowed elements to the much wider class of well-set algebraic elements, where well-set is a convexity type constraint. The extension field from R(x, y) to R(x, y, √ x2 + y2) removes this quadrilateral constraint as described in Chapter 8 of [E.L. Wachspress, A Rational Finite Element Basis, Academic Press, 1975]. The basis function construction described there is clarified here, first for concave quadrilaterals and then for concave polygons. Its application is enhanced by the GADJ algorithm [G. Dasgupta, E.L. Wachspress, The adjoint for an algebraic finite element, Computers and Mathematics with Applications, doi:10.1016/j.camwa.2004.03.021] for finding the denominator polynomial common to all the basis functions. c © 2008 Elsevier Ltd. All rights reserved.
منابع مشابه
Bi-concave Functions Defined by Al-Oboudi Differential Operator
The purpose of the present paper is to introduce a class $D_{Sigma ;delta }^{n}C_{0}(alpha )$ of bi-concave functions defined by Al-Oboudi differential operator. We find estimates on the Taylor-Maclaurin coefficients $leftvert a_{2}rightvert $ and $leftvert a_{3}rightvert$ for functions in this class. Several consequences of these results are also pointed out in the form of corollaries.
متن کاملThe Sugeno fuzzy integral of concave functions
The fuzzy integrals are a kind of fuzzy measures acting on fuzzy sets. They can be viewed as an average membershipvalue of fuzzy sets. The value of the fuzzy integral in a decision making environment where uncertainty is presenthas been well established. Most of the integral inequalities studied in the fuzzy integration context normally considerconditions such as monotonicity or comonotonicity....
متن کاملAn Edge Labeling Approach to Concave Polygon Clipping
This paper describes an algorithm to perform clipping of two possibly concave polygons. The approach labels the edges of the input polygons. This labeling is used in classifying the resulting polygons in the sets A \ B, A n B and B n A. It is shown that its worst-case time complexity is not worse than the worst-case complexity of the problem of polygon clipping itself. Suggestions are made how ...
متن کاملGuarding curvilinear art galleries with vertex
10 One of the earliest and most well known problems in computational geometry is 11 the so-called art gallery problem. The goal is to compute the minimum number of 12 guards needed to cover the interior of any polygon with n vertices; the guards are 13 to be placed on the vertices of the polygon. We consider the problem of guarding an 14 art gallery which is modeled as a polygon with curvilinea...
متن کاملA new algorithm for computing Boolean operations on polygons
This paper presents a new algorithm for computing Boolean operations on polygons. This kind of operations are frequently used in Geosciences in order to get spatial information from spatial data modeled as polygons. The presented algorithm is simple and easy to understand and implement. Let n be the total number of edges of all the polygons involved in a Boolean operation and k be the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 56 شماره
صفحات -
تاریخ انتشار 2008